Algorithms for linear groups of finite rank

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Algorithms for linear groups of finite rank

Article history: Received 21 January 2013 Available online 16 July 2013 Communicated by Derek Holt

متن کامل

Definably Linear Groups of Finite Morley Rank

Introduction. Zilber’s original trichotomy conjecture proposed an explicit classification of all one-dimensional objects arising in model theory. At one point, classifying the simple groups of finite Morley rank was viewed as a subproblem whose affirmative answer would justify this conjecture. Zilber’s conjecture was eventually refuted by Hrushovski [9], and the classification of simple groups ...

متن کامل

Linear groups of finite Morley rank

Zilber’s original trichotomy conjecture proposed an explicit classification of all one-dimensional objects arising in model theory. At one point, classifying the simple groups of finite Morley rank was viewed as a subproblem whose affirmative answer would justify this conjecture. Zilber’s conjecture was eventually refuted by Hrushovski [], and the classification of simple groups of finite Morle...

متن کامل

Linear representations of soluble groups of finite Morley rank

Sufficient conditions are given for groups of finite Morley rank having non-trivial torsion-free nilpotent normal subgroups to have linear representations with small kernels. In particular, centreless connected soluble groups of finite Morley rank with torsion-free Fitting subgroups have faithful linear representations. On the way, using a notion of definable weight space, we prove that certain...

متن کامل

Algorithms for Polycyclic-by-finite Groups Algorithms for Polycyclic-by-finite Groups Table of Contents

OF THE DISSERTATION Algorithms for Polycyclic-by-Finite Groups by Gretchen Ostheimer Dissertation Director: Professor Charles C. Sims Let R be a number eld. We present several algorithms for working with polycyclicbynite subgroups of GL(n;R). Let G be a subgroup of GL(n;R) given by a nite generating set of matrices. We describe an algorithm for deciding whether or not G is polycyclic-bynite. Fo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Algebra

سال: 2013

ISSN: 0021-8693

DOI: 10.1016/j.jalgebra.2013.06.006